Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept
نویسندگان
چکیده
This note connects two topics of complexity theory: The topic of succinct circuit representations initiated by Galperin and Wigderson (19831, and the topic of leaf language classes initiated by Bovet et al. (1992). It will be shown for any language that its succinct version is polynomial-time many-one complete for the leaf language class determined by it.
منابع مشابه
Succinct Circuit Representations and Leaf Languages are Basically the same Concept
1 Introduction
متن کاملSuccinct Representation and Leaf Languages
In this paper, we present stronger results in the theory of succinct problem representation and establish a close relationship between succinct problems and leaf languages. As a major tool, we use projection reductions from descriptive complexity theory. A succinct problem is a problem whose high complexity stems from the fact that its instances are not given straightforward, but are themselves...
متن کاملGender Concept “Woman” in the Minds of the Russian People (Taking the Chinese as Reference) According to an Associative Experiment
The article is devoted to the study of language representations of the concept of “woman” in the minds of the Russian and Chinese people based on a comparison of associative experiments of two languages, identifying the dynamics of the concept in the language consciousness of the people, establishing the specificity of the concept in the Russian language picture of the world referring to the Ch...
متن کامل‘Representational Repertoires’ of Neoliberal Ideologies in Interchange (Third Edition) Series
Considering the fact that engagement with political economy is central to any fully rounded analysis of language and language-related issues in the neoliberal-stricken world today, and that applied linguistics has ignored the role of political economy (Block, Gray, & Holborow, 2012), for the first time, this study investigated the representations of neoliberal ideologies in the Interchange Thi...
متن کاملSuccinct Inputs, Lindström Quantifiers, and a General Complexity Theoretic Operator Concept
We address the question of the power of several logics with Lindström quantifiers over finite ordered structures. We will see that in the first-order case this nicely fits into the framework of Barrington, Immerman, and Straubing’s examination of constant depth circuit classes. In the second-order case we get a strong relationship to succinct encodings of languages via circuits. Some of these l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 3 شماره
صفحات -
تاریخ انتشار 1996